DIAGNOSIS OF DISCRETE–EVENT SYSTEM DESCRIBED BY TIMED AUTOMATA
نویسندگان
چکیده
منابع مشابه
Diagnosis of Discrete–event System Described by Timed Automata
This paper presents the model–based diagnosis in the framework of discrete–event systems. Timed automata are used as a discrete–event representation which is suitable for consistency–based diagnosis. The diagnostic statement is based on the observation whether the measured event–time sequences are consistent with the timed automata. The diagnostic algorithm can be applied online because it dete...
متن کاملUsing Interval Petri Nets and Timed Automata for Diagnosis of Discrete Event Systems (DES)
A discrete event system (DES) is a dynamic system that evolves in accordance with the abrupt occurrence, at possibly unknown irregular intervals, of physical events. Because of the special nature of these systems, different tools are currently used for their analysis, design and modeling. The main focus of this paper is the presentation of a new modeling approach of Discrete Event Systems. The ...
متن کاملFault Diagnosis for Timed Automata
In this paper we study the problem of fault diagnosis in the context of dense-time automata. Our work is inspired from [SSL95, SSL96], who have studied the problem in the context of discrete event systems (DES) [RW87]. We stick to the terminology used in the above papers, although we find the term fault detection, rather than diagnosis, more appropriate. Indeed, the objective is to design an ob...
متن کاملFault Diagnosis Using Timed Automata
Fault diagnosis consists in observing behaviours of systems, and in detecting online whether an error has occurred or not. In the context of discrete event systems this problem has been well-studied, but much less work has been done in the timed framework. In this paper, we consider the problem of diagnosing faults in behaviours of timed plants. We focus on the problem of synthesizing fault dia...
متن کاملA Proof System for Timed Automata
A proof system for timed automata is presented, based on a CCS-style language for describing timed automata. It consists of the standard monoid laws for bisimula-tion and a set of inference rules. The judgments of the proof system are conditional equations of the form t = u where is a clock constraint and t, u are terms denoting timed automata. It is proved that the proof system is complete ove...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC Proceedings Volumes
سال: 2002
ISSN: 1474-6670
DOI: 10.3182/20020721-6-es-1901.00744